Some Remarks on the Π-directable Automata and Definite Automata: a Survey
نویسنده
چکیده
The concept of π-directable automata is a concomitant specialization concept of the directable automata and generalization of the concept definite automata. The main purpose of this survey is to describe certain properties of πdirectable and definite automata. These are mainly algebraic and structural properties, as well as the properties of their transition semigroups. Various specializations and generalizations of directable automata are an interesting field of Automata theory. They have useful applications in industrial context and still offer open questions. There are applications in the fields of many-valued logics, biocomputing, set theory, etc.
منابع مشابه
Decompositions of Automata and Transition Semigroups
The purpose of this paper is to describe structural properties of automata whose transition semigroups have a zero, left zero, right zero or bi-zero, or are nilpotent extensions of rectangular bands, left zero bands or right zero bands, or are nilpotent. To describe the structure of these automata we use various well-known decomposition methods of automata theory – direct sum decompositions, su...
متن کاملGeneralized Directable Automata
In [18] the last three authors introduced the notion of a generalized directable automaton as a generalization of many already known types of automata. The algorithms for testing whether a finite automaton belongs to some of important subclasses of the class of generalized directable automata are studied by the authors in [20]. In this paper structural properties of finite and infinite generali...
متن کاملShortest directing words of nondeterministic directable automata
In this paper, we will survey several results on the shortest directing words of various types of nondeterministic directable automata.1 © 2007 Elsevier B.V. All rights reserved.
متن کاملThe Cerny Conjecture for Automata with Blocking States
In [7], Jan Černý conjectured that an arbitrary directable automaton with n states has a directing word of length not longer than (n−1). This conjecture is one of the most longstanding open problems in the theory of finite automata. Most of papers dealing with this conjecture reduce the problem to special classes of automata. In present paper we deal with this conjecture in the class of automat...
متن کاملDirectable Fuzzy and Nondeterministic Automata
We study three notions of directability of fuzzy automata akin to the D1-, D2and D3-directability of nondeterministic automata. Thus an input word w of a fuzzy automaton is D1-directing if a fixed single state is reachable by w from all states, D2-directing if exactly the same states are reachable by w from every state, and D3-directing if there is a state reachable by w from every state. We st...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015